Confinement of matroid representations to subsets of partial fields
نویسندگان
چکیده
Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P′ ⊆ P. We say that B confines M to P′ if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled P′-matrix. We show that, under some conditions on the partial fields, on M , and on B, verifying whether B confines M to P′ amounts to a finite check. A corollary of this result is Whittle’s Stabilizer Theorem [34]. A combination of the Confinement Theorem and the Lift Theorem from Pendavingh and Van Zwam [19] leads to a short proof of Whittle’s characterization of the matroids representable over GF(3) and other fields [33]. We also use a combination of the Confinement Theorem and the Lift Theorem to prove a characterization, in terms of representability over partial fields, of the 3-connected matroids that have k inequivalent representations over GF(5), for k = 1, . . . , 6. Additionally we give, for a fixed matroid M , an algebraic construction of a partial field PM and a representation matrix A over PM such that every representation of M over a partial field P is equal to φ(A) for some homomorphism φ : PM → P. Using the Confinement Theorem we prove an algebraic analog of the theory of free expansions by Geelen, Oxley, Vertigan, and Whittle [12].
منابع مشابه
Skew Partial Fields, Multilinear Representations of Matroids, and a Matrix Tree Theorem
ABSTRACT. We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte’s definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte’s representability criterion to this new class, and we study the generator matrices of the chain groups. An ...
متن کاملLifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields F1, . . . ,Fk, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First, parts of Whittle’s characterization of representations of ternary matroids follow from our theorem. Second, we prove the following theorem by Vertigan: if a m...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملOn the Representability of the Biuniform Matroid
Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid is an open problem too. The interest of these problems is due to their implications to secret sharing. Efficient methods to find representation...
متن کاملOn inequivalent representations of matroids over non-prime fields
For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that this would extend to all finite fields, however, it was not to be. The (m,n)-mace is the matroid obtained by adding a point freely to M(Km,n). For all n ≥ 3, the (3, n)-mace is 4-connected and has at least 2 representations over an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010